Online Load Balancing on Unrelated Machines with Startup Costs

نویسندگان

  • Yossi Azar
  • Debmalya Panigrahi
چکیده

Motivated by applications in energy-efficient scheduling in data centers, Khuller, Li, and Saha introduced the machine activation problem as a generalization of the classical optimization problems of minimum set cover and minimum makespan scheduling on parallel machines. In this problem, a set of n jobs have to be distributed among a set of m (unrelated) machines, given the processing time of each job on each machine. Additionally, each machine incurs a startup cost if at least one job is assigned to it. The goal is to produce a schedule of minimum total startup cost subject to a constraint L on its makespan. While Khuller et al considered the offline version of this problem, a typical scenario in scheduling is one where jobs arrive online and have to be assigned to a machine immediately on arrival. We give an (O(log(mn) logm),O(logm))-competitive randomized online algorithm for this problem, i.e. the schedule produced by our algorithm has a makespan of O(L logm) with high probability, and a total expected startup cost of O(log(mn) logm) times that of an optimal offline schedule with makespan L. Our algorithm is almost optimal since it follows from previous results that the two approximation factors cannot be improved to o(logm logn) (under standard complexity assumptions) and o(logm) respectively. Our algorithms use the online primal dual framework introduced by Alon et al for the online set cover problem, and subsequently developed further by Buchbinder, Naor and co-authors in various papers. To the best of our knowledge, all previous applications of this framework have been to linear programs (LPs) with either packing or covering constraints. One novelty of our application is that we use this framework for a mixed LP that has both covering and packing constraints. We combine the packing constraint with the objective function to design a potential function on the machines that is exponential in the current load of the machine and linear in the cost of the machine. Then, we create a dynamic order of machines based on this potential function and assign larger fractions of the job to machines that appear earlier in this order. This allocation is somewhat unusual in that the increase in load on a machine is inverse in the value of this potential function itself, i.e. inverse exponential in the current load on the machine. Finally, we show that we can round this fractional solution online using a randomized algorithm. We hope that the algorithmic techniques developed in this paper to simultaneously handle packing and covering constraints will be useful for solving other online optimization problems as well. ∗Part of this work was done while the first author was visiting and the second author was an intern at Microsoft Research, Redmond, WA 98052. †Blatavnik School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel. Email: [email protected]. ‡Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. Email: [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm

Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...

متن کامل

On the Competitive Analysis of Randomized Static Load Balancing

Static load balancing is attractive due to its simplicity and low communication costs. We analyze under which circumstances a randomized static load balancer can achieve good balance if the subproblem sizes are unknown and choosen by an adversary. It turns out that this worst case scenario is quite close to a more specialized model for applications related to parallel backtrack search. In both ...

متن کامل

Energy Conscious Dynamic Provisioning of Virtual Machines using Adaptive Migration Thresholds in Cloud Data Center

The fast growing demand for computational power utilized by modern applications with rapidly changing Cloud computing technology have directed to the foundation of large-scale virtualized data centers. Such data centers consume massive amounts of electrical energy resulting in high operating costs and carbon dioxide (CO2) emissions. Dynamic consolidation of virtual machines (VMs) using Dynamic ...

متن کامل

Scalable Load Balancing

In this paper, we develop load balancing strategies for scalable high-performance parallel A* algorithms suitable for distributed-memory machines. In parallel A* search, ineeciencies such as processor starvation and search of nonessential spaces (search spaces not explored by the sequential algorithm) grow with the number of processors P used, thus restricting its scalability. To alleviate this...

متن کامل

GASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment

The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1203.4619  شماره 

صفحات  -

تاریخ انتشار 2012